A Bound on Measurable Chromatic Numbers of Locally Finite Borel Graphs

نویسندگان

  • Clinton T. Conley
  • Benjamin D. Miller
چکیده

We show that the Baire measurable chromatic number of every locally finite Borel graph on a non-empty Polish space is strictly less than twice its ordinary chromatic number, provided this ordinary chromatic number is finite. In the special case that the connectedness equivalence relation is hyperfinite, we obtain the analogous result for the μ-measurable chromatic number.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Measurable 3-colorings of Acyclic Graphs

This is the first of two lectures on measurable chromatic numbers given in June 2010 at the University of Barcelona. Our main result here is that acyclic locally finite analytic graphs on Polish spaces admit Baire measurable 3-colorings.

متن کامل

Measurable chromatic numbers

We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three. In particular, this holds for the graph of the unilateral shift on [N]N, although its Borel chromatic number is א0. We also show that if add(null) = c, then the universally measurable chromatic number of every treei...

متن کامل

Measurable Perfect Matchings for Acyclic Locally Countable Borel graphs

We characterize the structural impediments to the existence of Borel perfect matchings for acyclic locally countable Borel graphs admitting a Borel selection of finitely many ends from their connected components. In particular, this yields the existence of Borel matchings for such graphs of degree at least three. As a corollary, it follows that acyclic locally countable Borel graphs of degree a...

متن کامل

Lower Bounds for Measurable Chromatic Numbers

The Lovász theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of distance graphs on compact metric spaces. In particular we consider distance graphs on the unit sphere. There we transform the original infinite semidefinit...

متن کامل

Measurable chromatic and independence numbers for ergodic graphs and group actions

We study in this paper some combinatorial invariants associated with ergodic actions of infinite, countable (discrete) groups. Let (X,μ) be a standard probability space and Γ an infinite, countable group with a set of generators 1 / ∈ S ⊆ Γ. Given a free, measure-preserving action a of Γ on (X,μ), we consider the graph G(S, a) = (X,E(S, a)), whose vertices are the points in X and where x 6= y ∈...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014